Master of Logic Project Report: Lattice Based Cryptography and Fully Homomorphic Encryption
نویسنده
چکیده
Vectors and matrices are denoted by bold lowercase and uppercase letters. For purposes of matrix multiplication, all vectors are considered as column vectors. We denote the floor and ceiling functions by b·c and d·e respectively. Rounding to the closest integer (to the smaller one if there are two) is denoted by b·e. For q ∈ Z, let Zq = (bq/2c, bq/2c] ∩ Z and for x ∈ Z, let [x]q be the unique y ∈ Zq such that x = y+kq for some integer k. For vectors x ∈ Z, [x]q denotes the component-wise application of this operation. Note that here, Zq does not denote the ring Z/Zq. In particular, for x ∈ R and y ∈ Zq, x · y denotes the multiplication of x and y in R. The standard scalar product is denoted by 〈·, ·〉 and the euclidean norm by || · ||. Let ∼⊆ R × R be the relation defined by x ∼ y ⇔ ∃k ∈ Z : x + k = y. Let T = R/ ∼. For x ∈ R, we denote x/ ∼∈ T by x mod T. A function : N → R is called negligible if for every polynomial function p, there is some n0 ∈ N such that for all n ≥ n0, (n) < p(n)−1. A function δ : N → R is called overwhelming if there is a negligible function such that δ(n) ≥ 1− (n) for all n. For s > 0 and c ∈ R,let ρ s,c (x) = exp(π||(x− c)/s||). The total measure is ∫ x∈Rn ρs,c(x)dx = s n and the density function of the continuous Gaussian
منابع مشابه
Recent Results in Lattice-Based Cryptography
In this report we describe a fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem. Firstly we introduce some definitions related to lattices and some operators which will be needed to build an efficient fully homomorphic encryption system base on LWE. The main focus in this report is to explain the new technique to building FHE schemes that is called the app...
متن کاملClassification of Lattice-based Fully Homomorphic Encryption from Noisy Polly Cracker*
Lattices have been used to construct many cryptographic primitives after Ajtai’s seminal paper in 1996. The goal of this paper is to design novel cryptographic primitives using lattices, which are still found to be no polynomial time attack by quantum computers. For achieving this, we survey the known lattice-based cryptography and lattice-based fully homomorphic encryption schemes as a first s...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملA Lattice-Based Universal Thresholdizer for Cryptographic Systems
We develop a general approach to thresholdizing a large class of (non-threshold) cryptographic schemes. We show how to add threshold functionality to CCA-secure public-key encryption (PKE), signature schemes, pseudorandom functions, and others primitives. To do so, we introduce a general tool, called a universal thresholdizer, from which many threshold systems are possible. The tool builds upon...
متن کاملCryptanalysis of the Smart-Vercauteren and Gentry-Halevi's Fully Homomorphic Encryption
For the fully homomorphic encryption schemes in [SV10, GH11], this paper presents attacks to solve equivalent secret key and directly recover plaintext from ciphertext for lattice dimensions n=2048 by using lattice reduction algorithm. According to the average-case behavior of LLL in [NS06], their schemes are also not secure for n=8192.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012